Contains Duplicate II

Given an array of integers and an integer k, find out whether there are two distinct indices i and j in the array such that nums[i] = nums[j] and the difference between i and j is at most k.

Solution:

  1. public class Solution {
  2.   public boolean containsNearbyDuplicate(int[] nums, int k) {
  3.     Map<Integer, Integer> map = new HashMap<>();
  5.     for (int i = 0; i < nums.length; i++) {
  6.       if (map.containsKey(nums[i]) && i - map.get(nums[i]) <= k) {
  7.         return true;
  8.       }
  10.       map.put(nums[i], i);
  11.     }
  13.     return false;
  14.   }
  15. }